FSM-Hume is finite state
نویسندگان
چکیده
Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions characterised by pattern matching on inputs and recursive function generation of outputs. Here we discuss the design of FSM-Hume, a strict finite state subset of Hume, and suggest that it is indeed classically finite state.
منابع مشابه
Detecting faults in TFTP implementations using Finite State Machines with timeouts
In this paper, we consider a test derivation strategy for testing protocol implementations based on Finite State Machines with timeouts. The strategy is applied for testing TFTP implementations. Keywords-Finete State Machine (FSM); FSM with timeouts (timed FSM); transition tour
متن کاملFinding Redundant Constraints in FSM Minimization
Finite state machine (FSM) is a computation model that consists of a finite set of states, a start state, an input alphabet, and a transition function that defines the next state and/or outputs based on the current state and input symbols. Finding an equivalent FSM with minimal number of states is generally referred as state minimization or state reduction (SR) problem. State minimization is an...
متن کاملGALLOP: Genetic Algorithm based Low Power FSM Synthesis by Simultaneous Partitioning and State Assignment
Partitioning has been shown to be an effective method for synthesis of low power finite state machines. In this approach, an FSM is partitioned into two or more coupled sub-machines such that most of the time only one of the sub-machines is active. In this paper, we present a GA based approach for simultaneous partitioning and state assignment of finite state machines with power reduction as th...
متن کاملHierarchical Concurrent Finite State Machines in Ptolemy
tics. For example, the co-design finite state machines We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is successfully integrated with synchronous dataflow (SDF) and discrete-event (DE) concurrency domains in Ptolemy. In this heterogeneous combination, the semantics of FSM, c...
متن کاملDeriving Test Suites for Timed Finite State Machines
This paper is devoted to the derivation of distinguishing sequences for timed Finite State Machines (FSM). Such distinguishing sequences are used when deriving a test suite for a timed FSM with the guaranteed fault coverage.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003